Digital Systems Concepts Quiz - Set 3 (10 Questions)

1. What is the primary goal of simplifying Boolean expressions using any method?

2. Which method of Boolean simplification relies heavily on applying Boolean algebra theorems and laws?

3. What is a key limitation of the Map Method (Karnaugh Map) for simplifying Boolean expressions?

4. How are adjacent cells identified in a Karnaugh Map?

5. What is the main advantage of the Tabulation Method (Quine-McCluskey) over the K-map method?

6. In the Tabulation Method, what is the first step when grouping minterms?

7. When using the Algebraic Method, which Boolean theorem states that $A + AB = A$?

8. How many cells does a 4-variable Karnaugh Map have?

9. What is the term for a product term that cannot be combined with any other product term to eliminate a literal in the Tabulation Method?

10. Which simplification method is generally preferred for manual simplification of Boolean expressions with 3 to 5 variables due to its graphical nature?